The polynomial and linear time hierarchies in V0
نویسندگان
چکیده
We show that the bounded arithmetic theory V does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some auxiliary input; we derive this from a theorem of Ajtai.
منابع مشابه
Expansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind
In this paper, the Bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (IEMTL) through expansion methods (collocation method, partition method, Galerkin method). The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is car...
متن کاملReconstructing noisy polynomial evaluation in residue rings
Let q > 1 be an integer and let a and b be elements of the residue ring ZZq of integers modulo q. We show how, when given a polynomial f ∈ ZZq[X] and approximations to v0, v1 ∈ ZZq such that v1 ≡ f(v0) mod q one can recover v0 and v1 efficiently. This result has direct applications to predicting the polynomial congruential generator: a sequence (vn) of pseudorandom numbers defined by the relati...
متن کاملکاربرد ماشین بردار پشتیبان در طبقه‌بندی کاربری اراضی حوزه چشمه کیله- چالکرود
Classification of land use extraction always been one of the most important applications of remote sensing and why different methods are created. Over time and with greater accuracy were developed more advanced methods that increase the accuracy and the extraction classes that were closer together in terms of quality are better. SVM is one of these methods in the study of this method for the ex...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملGames of no return a
Let D = (V,A) be a finite directed graph (digraph) each vertex v ∈ V of which is interpreted as a position and each arc a = (v, v′) ∈ A as a possible move from position v to v′. Two players, 1 and 2, take turns moving a token from a given initial position v0. The game ends as soon as the token returns to a position, where it has already been. By definition, the player who made the last move los...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 55 شماره
صفحات -
تاریخ انتشار 2009